Column Generation for the Minimum Hyperplanes Clustering Problem
نویسندگان
چکیده
منابع مشابه
An improved column generation algorithm for minimum sum-of-squares clustering
Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC) consist in partitioning this set into clusters such that the sum of squared distances from each point to the centroid of its cluster is minimized. A column generation algorithm for MSSC was given in du Merle et al. [15]. The bottleneck of that algorithm is resolution of the auxiliary prob...
متن کاملClassifying negative and positive points by optimal box clustering
In this paper we address the problem of classifying positive and negative data with the technique known as box clustering. A box is homogeneous if it contains only positive (negative) points. Box clustering means finding a family of homogeneous boxes jointly containing all and only positive (negative) points. We first consider the problem of finding a family with the minimum number of boxes. Th...
متن کاملConstrained Clustering Using Column Generation
In recent years, it has been realized that many problems in data mining can be seen as pure optimisation problems. In this work, we investigate the problem of constraint-based clustering from an optimisation point of view. The use of constraints in clustering is a recent development and allows to encode prior beliefs about desirable clusters. This paper proposes a new solution for minimum-sum-o...
متن کاملConstrained Minimum Sum of Squares Clustering by Constraint Programming
The Within-Cluster Sum of Squares (WCSS) is the most used criterion in cluster analysis. Optimizing this criterion is proved to be NP-Hard and has been studied by different communities. On the other hand, Constrained Clustering allowing to integrate previous user knowledge in the clustering process has received much attention this last decade. As far as we know, there is a single approach that ...
متن کاملMinimum Density Hyperplanes
Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is a central assumption in statistical and machine learning approaches for the classification of unlabelled data. In unsupervised classification this cluster definition underlies a nonparametric approach known as density clustering. In semi-supervised classification, cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008